National Repository of Grey Literature 41 records found  1 - 10nextend  jump to record: Search took 0.02 seconds. 
Predictive Parsing with Deep Pushdowns
Viktorin, Jiří ; Blatný, Petr (referee) ; Meduna, Alexandr (advisor)
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep pushdown automata expand a pushdown symbol in a depth defined by a rule. Deep pushdown expands a non-terminal in the deep defined in the rule and this non-terminal need not be on the top of pushdown.
Evolutionary Design of Hash Functions Using Grammatical Evolution
Freiberg, Adam ; Bidlo, Michal (referee) ; Sekanina, Lukáš (advisor)
Grammatical evolution allows us to automate creating solutions to various problems in arbitrary programming languages. This thesis takes advantage of this method to experimentally generate new hash functions focused specifically on network flow hashing. Subsequently, these newly generated functions are compared with existing state-of-the-art hash functions, created by experts in the field.
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
Grammar-Based Translation Framework
Vít, Radek ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
V této práci prozkoumáváme existující algoritmy pro přijímání jazyků definovaných bezkontextovými gramatikami. Na základě těchto znalostí navrhujeme nový model pro reprezentaci LR automatů a s jeho pomocí definujeme nový algoritmus LSCELR. Modifikujeme algoritmy pro přijímání jazyků k vytvoření algoritmů pro překlad založený na překladových gramatikách. Definujeme atributové překladové gramatiky jako rozšířené překladové gramatiky pro definici vztahů mezi vstupními a výstupními symboly překladu. Implementujeme překladový framework ctf založený na gramatikách, který implementuje překlad pomocí LSCELR. Definujeme jazyk pro popis atributových překladových gramatik a implementujeme překladač pro překlad této reprezentace do zdrojového kódu pro implementovaný framework.
Path-Controlled Grammars
Adamec, Ondřej ; Soukup, Ondřej (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with path-controlled grammars, which are grammars that place restrictions on the paths in a derivation tree of a context-free grammar. The goal of this thesis is to create an algorithm for conversion between the path-controlled grammars and the state grammars, which is a di erent type of regulated grammars. Another goal is to study the generative power of path-controlled grammars based on the conversion algorithm. The conversion algorithm is implemented and tested on a number of path-controlled grammars. Also, its complexity is discussed. Finally, a parsing tool for path-controlled grammars is implemented. Complexity of this tool is analyzed as well.
IP Flow Filtration and Profiling
Sedlák, Michal ; Tisovčík, Peter (referee) ; Kučera, Jan (advisor)
This thesis addresses the problem of filtering and profiling IP flows, primarily data of IPFIXsystems. Within the work, a general filtering component is designed and implemented, whichaims to be sufficiently efficient and flexible for use in other projects related to IP flows. Thiscomponent is then adapted to work with data in the IPFIX protocol format and integratedinto the existing modular collector IPFIXcol2 in the form of plugins adding the support forfiltering of passing IPFIX data and their sorting into profiles.
Transformation of Grammars into Normal Forms
Klapuchová, Mirka ; Koutný, Jiří (referee) ; Zemek, Petr (advisor)
This thesis deals with issues of normal forms from theory of formal languages. Basic terms from this area are listed here, different types of grammars as well and especially normal forms and algorithms that transfer grammars into normal forms. Description of design and implementation of program which is used to transfer input grammar into entered normal form is included.
Languages, Grammars and Machines
Mocková, Ľubica ; Zimmerová, Barbora (referee) ; Bobalová, Martina (advisor)
My thesis is a brief synopsis of the basic types of formal languages, grammars and machines, which are a part of theoretical computer science. My thesis contains the survey of the theory related to the given topic and problems related to the theoretical part of my thesis. This work is to be used as a study material for the students of the Faculty of Business and Management for the subject of Discrete Mathematics. It can also be helpful for the students of other universities and faculties whose curricula contain theory of grammars and machines.
Application of Deep Pushdown Automata in Compilers
Viktorin, Jiří ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
In this thesis, I focus on the application of deep pushdown automatons in compilers, their composition in the parser, and the possibility of further recovery. Thanks to these automatons can carry out the expansion of the nonterminals in various depths and thus makes it possible to use other records of expressions.
Modified Deep Pushdown Automata
Škvařilová, Radka ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown automata and parallel deep pushdown automata. In theoretical part of this thesis is formal definition and research into power of these modification. Practical part consists of an implementation of simple automata program.

National Repository of Grey Literature : 41 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.